The Detour Framework for Packet Rerouting
نویسنده
چکیده
The Detour framework is a software infrastructure for alternative routing on the internet. It is being developed in conjunction with the Detour routing project, to serve as a mechanism for experimental deployment of new, performance-sensitive routing algorithms in the wide-area. The framework implements a virtual network that allows users of our system to take advantage of improved routing for real traac, without harming non-Detour users. The framework consists of the basic mechanisms required for managing the virtual network and coordinating the activities of the various routing and congestion control algorithms running at each node. The performance is suucient for our experimental needs, and some discussion of techniques for improving performance is included.
منابع مشابه
DMP: Detouring Using Multiple Paths against Jamming Attack for Ubiquitous Networking System
To successfully realize the ubiquitous network environment including home automation or industrial control systems, it is important to be able to resist a jamming attack. This has recently been considered as an extremely threatening attack because it can collapse the entire network, despite the existence of basic security protocols such as encryption and authentication. In this paper, we presen...
متن کاملThe explicit relation among the edge versions of detour index
The vertex version of detour index was defined during the works on connected graph in chemistry. The edge versions of detour index have been introduced ecently. In this paper, the explicit relations among edge versions of detour index have been declared and due to these relations, we compute the edge detour indices for some well-known graphs.
متن کاملTraffic Engineering with Rerouting in Diffserv Mpls Networks
An important aspect of traffic engineering is the re-optimization of network resources. In this process, traffic over a congested path is rerouted to a new path to improve efficiency in network resource utilization. The aggregation nature of DiffServ MPLS networks often gives rise to long-lived flows within the network. A rerouting mechanism that supports the tearing-down of old connections and...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملA cooperative congestion management scheme for switched high-speed networks
In a wide-area network with high-speed links, congestion may lead to poor utilization and the degradation of the service provided to the users. This paper presents a Cooperative Congestion Management Scheme in which the intermediate nodes in the vicinity of a congested link share their resources to offload this link before packets are discarded. The scheme uses a progression of proactive contro...
متن کامل